Numerical Differentiation and the Solution of Multidimensional Vandermonde Systems
نویسندگان
چکیده
We define multidimensional Vandermonde matrices (MV) to be certain submatrices of Kronecker products of standard Vandermonde matrices. These MV matrices appear naturally in multidimensional problems of polynomial interpolation. An explicit algorithm is produced to solve systems of linear equations with MV matrices of coefficients. This is an extension of work of Stenger for the two-dimensional case. Numerical results for three-dimensional numerical differentiation are given.
منابع مشابه
Numerical Solution of Optimal Control of Time-varying Singular Systems via Operational Matrices
In this paper, a numerical method for solving the constrained optimal control of time-varying singular systems with quadratic performance index is presented. Presented method is based on Bernste in polynomials. Operational matrices of integration, differentiation and product are introduced and utilized to reduce the optimal control of time-varying singular problems to the solution of algebraic ...
متن کاملA hybrid method with optimal stability properties for the numerical solution of stiff differential systems
In this paper, we consider the construction of a new class of numerical methods based on the backward differentiation formulas (BDFs) that be equipped by including two off--step points. We represent these methods from general linear methods (GLMs) point of view which provides an easy process to improve their stability properties and implementation in a variable stepsize mode. These superioritie...
متن کاملNumerical Solution of Multidimensional Exponential Levy Equation by Block Pulse Function
The multidimensional exponential Levy equations are used to describe many stochastic phenomena such as market fluctuations. Unfortunately in practice an exact solution does not exist for these equations. This motivates us to propose a numerical solution for n-dimensional exponential Levy equations by block pulse functions. We compute the jump integral of each block pulse function and present a ...
متن کاملTR-2013003: Polynomial Evaluation and Interpolation: Fast and Stable Approximate Solution
Multipoint polynomial evaluation and interpolation are fundamental for modern algebraic and numerical computing. The known algorithms solve both problems over any field by using O(N log N) arithmetic operations for the input of size N , but the cost grows to quadratic for numerical solution. Our study results in numerically stable algorithms that use O(uN log N) arithmetic time for approximate ...
متن کاملPolynomial Evaluation and Interpolation: Fast and Stable Approximate Solution
Multipoint polynomial evaluation and interpolation are fundamental for modern algebraic and numerical computing. The known algorithms solve both problems over any field by using O(N log N) arithmetic operations for the input of size N , but the cost grows to quadratic for numerical solution. Our study results in numerically stable algorithms that use O(uN log N) arithmetic time for approximate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010